Cutting Corners or Enhancing Efficiency?

Cutting Corners

Cutting corners cheaply, or how to remove Steiner points

Our main result is that the Steiner point removal (SPR) problem can always be solved with polylogarithmic distortion, which answers in the affirmative a question posed by Chan, Xia, Konjevod, and Richa in 2006. Specifically, we prove that for every edge-weighted graph G = (V, E,w) and a subset of terminals T ⊆ V , there is a graph G′ = (T, E′, w′) that is isomorphic to a minor of G such that fo...

Cutting Corners: Workbench Automation for Server Benchmarking

A common approach to benchmarking a server is to measure its behavior under load from a workload generator. Often a set of such experiments is required— perhaps with different server configurations or workload parameters—to obtain a statistically sound result for a given benchmarking objective. This paper explores a framework and policies to conduct such benchmarking activities automatically an...

Contour Tracking by Enhancing Corners and Junctions

In a previous paper an approach was presented in which, given an approximated starting contour on the first frame, all the contours of the image sequence could be outlined automatically with the desired resolution. Although such an approach provided satisfactory results, singular isolated points, such as corners and junctions, gave rise to localization errors. The difficulties encountered at co...

Finding the Minimum-Cost Path Without Cutting Corners

Applying a minimum-cost path algorithm to find the path through the bottom of a curvilinear valley yields a biased path through the inside of a corner. DNA molecules, blood vessels, and neurite tracks are examples of string-like (network) structures, whose minimum-cost path is cutting through corners and is less flexible than the underlying centerline. Hence, the path is too short and its shape...